Report on NSF Workshop on Symbolic Computation for Constraint Satisfaction
نویسندگان
چکیده
منابع مشابه
Solving geometric constraint systems. II. A symbolic approach and decision of Rc-constructibility
This paper reports a geometric constraint solving approach based on symbolic computation. With this approach, we can compute robust numerical solutions for a set of equations. We give complete methods of deciding whether the constraints are independent and whether a constraint system is over-constraint. Also, over-constrainted systems can be handled naturally. Based on symbolic computation, we ...
متن کاملJ. Symbolic Computation (1996) 11, 1{000 Symbolic Constraints in Constructive Geometric Constraint Solving
In design and manufacturing applications, users of computer aided design systems want to de ne relationships between dimension variables, since such relationships express design intent very exibly. This work reports on a technique developed to enhance a class of constructive geometric constraint solvers with the capability of managing functional relationships between dimension variables. The me...
متن کاملExtending Prolog with Constraint Arithmetic on Real Intervals
Prolog can be extended by a system of constraints on closed intervals to perform declarative relational arithmetic. Imposing constraints on an interval can narrow its range and propagate the narrowing to other intervals related to it by constraint equations or inequalities. Relational interval arithmetic can be used to contain oating point errors and, when combined with Prolog backtracking, to ...
متن کاملNew Developments in Symmetry Breaking in Search Using Computational Group Theory
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, in the form of computational group theory. GE-trees are a new conceptual abstraction, providing low-degree polynomial time methods for breaking value symmetries in CSPs. In this paper we analyse the structure of symmet...
متن کاملThe Monoids of Order Eight and Nine
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of order 9 or less. Our approach is novel, using computer algebra to break symmetry and constraint satisfaction search to find candidate solutions. We present new results in algebraic combinatorics: up to isomorphism and ant...
متن کامل